Nearly equal distances in metric spaces

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nearly equal distances in metric spaces

Let (X, d) be any finite metric space with n elements. We show that there are two pairs of distinct elements in X that determine two nearly equal distances in the sense that their ratio differs from 1 by at most 9 logn n2 . This bound (apart for the multiplicative constant) is best possible and we construct a metric space that attains this bound. We discus related questions and consider in part...

متن کامل

Nearly Equal Distances in the Plane

distances determined by them? In particular, what is the maximum number of pairs of points that determine the same distance? Although a lot of progress has been made in this area, we are still very far from having satisfactory answers to the above questions (cf. [EP], [MP], [PA] for recent surveys). Two distances are said to be nearly the same if they differ by at most 1. If all points of a set...

متن کامل

Hardness of Embedding Metric Spaces of Equal Size

We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm to approximate the minimum distortion within a factor of Ω((log n)1/4−δ) for any constant δ > 0, unless NP ⊆ DTIME(n ). We give a simple reduction from the METRIC LABELING problem which was shown to be inapproximable by Chuzhoy ...

متن کامل

Banach-Like Distances and Metric Spaces of Compact Sets

In the first part we study general properties of the metrics obtained by isometrically identifying a generic metric space with a subset of a Banach space; we obtain a rigidity result. We then discuss the Hausdorff distance, proposing some less–known but important results: a closed–form formula for geodesics; generically two compact sets are connected by a continuum of geodesics. In the second p...

متن کامل

On the diameter of separated point sets with many nearly equal distances

A point set is separated if the minimum distance between its elements is 1. We call two real numbers nearly equal if they differ by at most 1. We prove that for any dimension d ≥ 2 and any γ > 0, if P is a separated set of n points in Rd such that at least γ n2 pairs in ( P 2 ) determine nearly equal distances, then the diameter of P is at least C(d, γ )n2/(d−1) for some constant C(d, γ ) > 0. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2014

ISSN: 0166-218X

DOI: 10.1016/j.dam.2014.05.010